A proof of convergence of general stochastic search for global minimum

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimum Stable Convergence Criteria for Stochastic Diffusion Search

This letter presents an analysis of Stochastic Diffusion Search that derives the minimum acceptable match resulting in a stable convergence based on a general noise parameter. The applicability of SDS can therefore be assessed for a given problem.

متن کامل

investigating the feasibility of a proposed model for geometric design of deployable arch structures

deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...

A Global Convergence Proof for a Class of Genetic Algorithms

In this paper a variant of a genetic algorithm is investigated which combines the advantages of genetic algorithms and of simulated annealing. In particular, under rather mild assumptions a global convergence result is derived.

متن کامل

The Effect of Minimum Wage on Iran's Macroeconomic Variables in The Framework of a Dynamic Stochastic General Equilibrium Model

In this paper ,in order to investigate the economic effects of the minimum wage policy on macroeconomic variables in the framework of the new Keynesian theory, a dynamic stochastic equilibrium general (DSGE) model has been simulated and estimated for an open and small oil exporter economy conforming with the structure of Iran's economy in the range from 1370 to 1395 .In the above mentioned mode...

متن کامل

A direct stochastic algorithm for global search

This paper presents a new algorithm called PGSL Probabilistic Global Search Lausanne. PGSL is founded on the assumption that optimal solutions can be identified through focusing search around sets of good solutions. Tests on benchmark problems having multi-parameter non-linear objective functions revealed that PGSL performs better than genetic algorithms and advanced algorithms for simulated an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Difference Equations and Applications

سال: 2007

ISSN: 1023-6198,1563-5120

DOI: 10.1080/10236190701396560